An elementary digital plane recognition algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An elementary digital plane recognition algorithm

A naive digital plane is a subset of points (x, y, z) ∈ Z3 verifying h ≤ ax+ by+ cz < h+max{|a|, |b|, |c|} where (a, b, c, h) ∈ Z4. Given a finite unstructured subset of Z3, determine whether there exists a naive digital plane containing it is called digital plane recognition. This question is rather classical in the field of digital geometry (also called discrete geometry). We suggest in this ...

متن کامل

An elementary algorithm for digital arc segmentation

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

Computational Aspects of Digital Plane and Hyperplane Recognition

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

An output-sensitive algorithm to compute the normal vector of a digital plane

A digital plane is the set of integer points located between to parallel planes. We solve the following problem: how to compute the exact normal vector of a digital plane given only a predicate that answers the question “is a point x in the digital plane or not”. Our approach is iterative and “as local as possible”. We provide a worst-case complexity bound in O(ω logω) calls to the predicate, w...

متن کامل

An algorithm to compute plane algebraic curves

This paper contains an algorithm, implemented in Magma, to compute singular plane algebraic curves. Two Magma functions are given: one computes linear systems of curves with non-ordinary singularities and the other computes a scheme of points such that there is a given degree plane curve with given singularities at these points. Some examples are presented so that the reader can quickly learn h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2005

ISSN: 0166-218X

DOI: 10.1016/j.dam.2005.02.026